A direct branching algorithm for checking equivalence of strict deterministic vs. LL(k) grammars
نویسندگان
چکیده
منابع مشابه
Strict Deterministic Aspects of Minimalist Grammars
The Minimalist Grammars (MGs) proposed by Stabler(1997) have tree-shaped derivations (Harkema, 2001b; Michaelis, 2001a). As in categorial grammars, each lexical item is an association between a vocabulary element and complex of features, and so the “yields” or “fringes” of the derivation trees are sequences of these lexical items, and the string parts of these lexical items are reordered in the...
متن کاملEvolutionary Branching in a Finite Population: Deterministic Branching vs. Stochastic Branching
Adaptive dynamics formalism demonstrates that, in a constant environment, a continuous trait may first converge to a singular point followed by spontaneous transition from a unimodal trait distribution into a bimodal one, which is called "evolutionary branching." Most previous analyses of evolutionary branching have been conducted in an infinitely large population. Here, we study the effect of ...
متن کاملDeterministic Timed Finite State Machines: Equivalence Checking and Expressive Power
There has been a growing interest in defining models of automata enriched with time. For instance, timed automata were introduced as automata extended with clocks. In this paper, we study models of timed finite state machines (TFSMs), i.e., FSMs enriched with time, which accept timed input words and generate timed output words. Here we discuss some models of TFSMs with a single clock: TFSMs wit...
متن کاملAn Algorithm for Comparing Deterministic Regular Tree Grammars
An algorithm to decide inclusion for languages de ned by deterministic regular tree grammars is presented. The algorithm is shown to run in polynomial time based on the number of constructors, constructor arity, and number of non-terminals. Correctness proofs are included. 1 Regular tree grammars A regular tree grammar, G, is a grammar for constructing trees. Formally, G = (C;N;P; S) where: 1. ...
متن کاملA Direct Algorithm for Multi-valued Bounded Model Checking
Multi-valued Model Checking is an extension of classical, two-valued model checking with multi-valued logic. Multi-valuedness has been proved useful in expressing additional information such as incompleteness, uncertainty, and many others, but with the cost of time and space complexity. This paper addresses this problem, and proposes a new algorithm for Multi-valued Model Checking. While Chechi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1983
ISSN: 0304-3975
DOI: 10.1016/0304-3975(83)90052-x